github.com/andybalholm/brotli.histogramPair.idx2 (field)

21 uses

	github.com/andybalholm/brotli (current package)
		cluster.go#L13: 	idx2       uint32
		cluster.go#L23: 	return (p1.idx2 - p1.idx1) > (p2.idx2 - p2.idx1)
		cluster_command.go#L14: 	p.idx2 = 0
		cluster_command.go#L15: 	p.idx1 = p.idx2
		cluster_command.go#L29: 	p.idx2 = idx2
		cluster_command.go#L103: 		best_idx2 = pairs[0].idx2
		cluster_command.go#L126: 				if p.idx1 == best_idx1 || p.idx2 == best_idx1 || p.idx1 == best_idx2 || p.idx2 == best_idx2 {
		cluster_distance.go#L16: 	p.idx2 = 0
		cluster_distance.go#L17: 	p.idx1 = p.idx2
		cluster_distance.go#L31: 	p.idx2 = idx2
		cluster_distance.go#L105: 		best_idx2 = pairs[0].idx2
		cluster_distance.go#L128: 				if p.idx1 == best_idx1 || p.idx2 == best_idx1 || p.idx1 == best_idx2 || p.idx2 == best_idx2 {
		cluster_literal.go#L16: 	p.idx2 = 0
		cluster_literal.go#L17: 	p.idx1 = p.idx2
		cluster_literal.go#L31: 	p.idx2 = idx2
		cluster_literal.go#L105: 		best_idx2 = pairs[0].idx2
		cluster_literal.go#L128: 				if p.idx1 == best_idx1 || p.idx2 == best_idx1 || p.idx1 == best_idx2 || p.idx2 == best_idx2 {